Simulated Annealing for the 0/1 Multidimensional Knapsack Problem
نویسندگان
چکیده
In this paper a simulated annealing (SA) algorithm is presented for the 0/1 multidimensional knapsack problem. Problem-specific knowledge is incorporated in the algorithm description and evaluation of parameters in order to look into the performance of finite-time implementations of SA. Computational results show that SA performs much better than a genetic algorithm in terms of solution time, whilst having a modest loss of solution quality.
منابع مشابه
Stochastic Local Search combined with Simulated Annealing for the 0-1 Multidimensional Knapsack Problem
The 0-1 Multidimensional Knapsack Problem (MKP) is a widely-studied problem in combinatorial optimization domaine which has been proven as NP-hard. Various approximate heuristics have been developed and applied effectively to this problem, such as local search and evolutionary methods. This paper proposes the Stochastic Local Search-Simulated Annealing (SLSA) approach that combines the stochast...
متن کاملCoordinating metaheuristic agents with swarm intelligence
Coordination of multi agent systems remains as a problem since there is no prominent method to completely solve this problem. Metaheuristic agents are specific implementations of multi-agent systems, which imposes working together to solve optimisation problems with metaheuristic algorithms. The idea borrowed from swarm intelligence seems working much better than those implementations suggested...
متن کاملSolving Resource-Constrained Project Scheduling Problem As a Sequence of Multi-Knapsack Problems
This paper describes a new technique for solving the duration minimization in a resourceconstrained network. It is based on a transformation of the resource-constrained project scheduling problem (RCPSP) to a sequence of (multi)knapsack problem (MKP) solutions. In the first part, three deterministic approaches are summarized and their time complexity is discussed. Due to the combinatorial natur...
متن کاملA Hybrid Fine-Tuned Multi-Objective Memetic Algorithm
In this paper, we propose a hybrid fine-tuned multiobjective memetic algorithm hybridizing different solution fitness evaluation methods for global exploitation and exploration. To search across all regions in objective space, the algorithm uses a widely diversified set of weights at each generation, and employs a simulated annealing to optimize each utility function. For broader exploration, a...
متن کاملComparison of Heuristic Algorithms in Functions Optimization and Knapsack Problem
This paper addresses the comparison of heuristic algorithms in the case of real functions optimization and knapsack problem. Metaheuristics for algorithms hill climbing, simulated annealing, tabu search and genetic algorithm are shown, test results are presented and conclusions are drawn. Input parameters for optimization functions problem are optimised on a sample of functions. Also, algorithm...
متن کامل